Fq-Linear Cyclic Codes over Fq: DFT Characterization
نویسندگان
چکیده
Codes over Fqm that form vector spaces over Fq are called Fq-linear codes over Fqm . Among these we consider only cyclic codes and call them Fq-linear cyclic codes (FqLC codes) over Fqm . This class of codes includes as special cases (i) group cyclic codes over elementary abelian groups (q = p, a prime), (ii) subspace subcodes of Reed-Solomon codes and (iii) linear cyclic codes over Fq (m=1). Transform domain characterization of FqLC codes is obtained using Discrete Fourier Transform (DFT) over an extension field of Fqm . We show how one can use this transform domain structures to estimate a minimum distance bound for the corresponding quasicyclic code by BCH-like argument.
منابع مشابه
Construction of quasi-cyclic self-dual codes
There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...
متن کاملCyclic codes over some special rings
In this paper we will study cyclic codes over some special rings: Fq[u]/(u ),Fq[u1, ..., ui]/(u 2 1, u 2 2, ..., u 2 i , u1u2 − u2u1, ..., ukuj − ujuk, ...), Fq[u, v]/ ( u, v , uv − vu ) , q = p, where p is a prime number, r ∈ N−{0} and Fq is a field with q elements.
متن کاملSkew Cyclic codes over Fq+u\Fq+vFq+uvFq
In this paper, we study skew cyclic codes over the ring R = Fq + uFq + vFq + uvFq, where u 2 = u, v2 = v, uv = vu, q = p and p is an odd prime. We investigate the structural properties of skew cyclic codes over R through a decomposition theorem. Furthermore, we give a formula for the number of skew cyclic codes of length n over R.
متن کاملA new trace bilinear form on cyclic $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes
Let Fq be a finite field of cardinality q, where q is a power of a prime number p, t ≥ 2 an even number satisfying t 6≡ 1 (mod p) and Fqt an extension field of Fq with degree t. First, a new trace bilinear form on F n qt which is called ∆-bilinear form is given, where n is a positive integer coprime to q. Then according to this new trace bilinear form, bases and enumeration of cyclic ∆-self-ort...
متن کاملWeight distributions of cyclic codes with respect to pairwise coprime order elements
Let Fq be a finite field with q elements, where q = p , p is a prime, and s is a positive integer. An [n, k, d] linear code C is a k-dimensional subspace of Fq with minimum distance d. It is called cyclic if (c0, c1, . . . , cn−1) ∈ C implies (cn−1, c0, c1, . . . , cn−2) ∈ C. By identifying the vector (c0, c1, . . . , cn−1) ∈ Fq with c0 + c1x+ c2x 2 + · · ·+ cn−1c ∈ Fq[x]/(x − 1), any code C of...
متن کامل